/*
 * acm2481.c
 *
 *  Created on: 6 Apr 2010
 *      Author: xuxu
 */

#include<stdio.h>

int cmp(const void *a,const void *b)
{
	return *(int *)a-*(int *)b;
}

int main()
{
	int n;
	int num[101];
	int i,j;
	while(scanf("%d",&n)&&n)
	{
		for(i=0;i<n;i++)
		{
			scanf("%d",&num[i]);
		}
		qsort(num,n,sizeof(num[0]),cmp);
		i=0;
		printf("%d",num[0]);
		while(i+1<n&&num[i]==num[i+1])
			i++;
		i++;
		for(;i<n;i++)
		{
			printf(" %d",num[i]);
			while(i+1<n&&num[i]==num[i+1])
				i++;
		}
		printf("\n");
	}
	return 0;
}
